//TIM MAX VA MIN TRONG N SO NGUYEN 

#include <stdio.h>
#include <conio.h>
#include <iostream>
#include <sstream>
#include <stdlib.h>
using namespace std;
//DINH NGHIA HAM NHAP MANG N SO NGUYEN 
void NhapMangInt(int n , int* pI)
	{
		cout << "\n\tHay nhap " << n <<" so nguyen cach nhau khoang trong:" ; 
		for (int i=0;i<n;i++){ cin >> pI[i] ;} 
	}	
//====================================================

// HAM XUAT D phan tu dau tien cua mang nguyen M. 
void XuatMangInt(int D , int* M)
	{	cout << "\n\t" ; //"\tMang nay co " << D << " phan tu nguyen.\n";
		int k;
		for(k=0;k < D; k++)	
		{
			cout << M[k] << "\t";
		}
		cout << "\n";
	}
//=====================================================


// DINH NGHIA HAM KIEM TRA MOT SO NGUYEN M LA NGUYEN  TO HAY KHONG, NEU DUNG THI TRA VE K=0  ,
// NEU M KHONG NGUYEN TO THI TRA VE K LA SO UOC SO  , MANG pUScuaM chua cac uoc so cua M.  	
int KiemTraSNT(int M, int* pUScuaM)
	{	int K=0, *pL;
		pL = (int*)malloc(M*sizeof(int));
	
		for (int i=2;i<M;i++)
		{
		if(M%i==0){  pL[K]=i ; K++;}
		}
		pUScuaM=(int*)malloc(K*sizeof(int));
		pUScuaM=pL ; 
		return K;
		cout << "\n\tSO UOC SO : "	<< sizeof(pUScuaM) << "\n";		
	}
//===============================


// DINH NGHIA HAM TRICH MANG SO NGUYEN TO pSNT TU MANG N SO NGUYEN  pI  co d phan tu 
// SO LUONG SNT TRONG MANG pI tra ve trong demSNT_trong_pI, mang so nguyen to nam trong pSNT.
int   TrichMangSNT(int d,int* pI, int* pSNT)
		{ 	int  demSNT_trong_pI =0 , *pTemp;
			for(int i=0;i<d;i++)
			{	int demUScua_pIi = 0 , *pUS;
				pUS=(int*)malloc(pI[i]*sizeof(int));
				demUScua_pIi = KiemTraSNT(pI[i], pUS)	;
				if(demUScua_pIi==0){ pSNT[demSNT_trong_pI]=pI[i]; demSNT_trong_pI++ ;}
				free(pUS);
			}
			pTemp=(int*)malloc(demSNT_trong_pI*sizeof(int));
			// *pTemp=*pSNT;	// pSNT=pTemp;
			//free(pTemp);
			return demSNT_trong_pI;
		}
//=============================================

//HAM TRICH TU MANG NGUYEN INT D PHAN TU CAC BOI SO CUA X chua trong pBS_cua_X
void  TrichMangBSX(int D, int* pI , int X, int* pBS_cua_X )
		{
		int k=0;	
		for(int i =0; i<D ; i++) {	if(pI[i]%X==0&&pI[i]!=X) {pBS_cua_X[k]=pI[i];k++; } }
		cout << "\n\tMang cac Boi So cua " << X <<":";
		XuatMangInt(k,pBS_cua_X);
		}
//==================================================


// HAM TRICH TU MANG pI co D so nguyen int , gom cac so nguyen lon hon hai so lan can truoc sau trong mang.
void  TrichMang_nLn(int D , int* pI ,int*pnLn)
		{
		int k = 0;
		for(int i=1; i < D; i++)
		{
			if(pI[i]>pI[i-1]&&pI[i]>pI[i+1]){ pnLn[k]=pI[i] ; k++;}	
		}
		cout << "\n\tCac so lon hon hai so lan can trong mang:";
		XuatMangInt(k, pnLn);
		}	
		
//  HAM SO TIM CUC DAI TRONG MANG N NGUYEN 
int  TimMax(int d, int* pI)
		{
		int Max = pI[0];
		for(int i=1;i<d;i++)
			{
			if(Max<pI[i]){ Max= pI[i];}
			}
		return Max;
		}

// DINH NGHIA HAM SO TIM CUC TIEU TRONG MANG N NGUYEN 
int  TimMin(int d, int* pI)
		{
		int Min = pI[0];
		for(int i=1;i<d;i++)
			{
			if(Min>pI[i]){ Min= pI[i];}
			}
		return Min;
		}
//===========================Het ham tim cuc tieu

// HAM CHEN THEM MOT PHAN TU Y VAO VI TRI K CUA MOT MANG NGUYEN , VI TRI DAU MANG K=0;
int*  ThemPhanTuK(int D , int* pI , int Y, int k )
		{	if(k<=D) 
			{ 
			int* MangInt;
			MangInt=(int*)malloc((D+1)*sizeof(int));
			for(int i=0;i<k;i++){MangInt[i]=pI[i];}
			MangInt[k]= Y;
			for(int i=k;i<D;i++){ MangInt[i+1]=pI[i];}
			return MangInt;	
			}
			else { return pI;}
			
		}
//=======================================HET HAM CHEN THEM

// HAM BO BOT MOT PHAN TU TAI VI TRI K CUA MANG NGUYEN.  PHAN TU DAU TIEN CO VI TRI 0;

int*  XoaPhanTuK(int D , int* pI , int k )
		{	if(k<=D-1) 
			{
			int* MangInt ; 
			MangInt=(int*)malloc((D-1)*sizeof(int));
			for (int i=0; i<k;i++){		MangInt[i]=pI[i];	}
			for (int i=k+1; i<D;i++){	MangInt[i-1]=pI[i];	}
			return MangInt;
			}
			else{  return pI;}
		}
//====================================HET HAM BO BOT MOT PHAN TU TRONG MANG NGUYEN 

// HAM TINH TONG CAC SO LE TRONG MANG N SO NGUYEN 
int  TongCacSoLe(int D , int* Mang)
	{
		int Tong =0 ;
		for(int i=0; i<D; i++)
		{
			if(Mang[i]%2==1){Tong=Tong+Mang[i];}
		}
		return Tong;
	}
//================================================

// HAM XOA TAT CA NHUNG SO NGUYEN BANG X TRONG MANG NGUYEN pI
void  XoaX_in_MangInt(int D, int* MangInt, int X)
	{	int* MangTam=MangInt;
		int  d=0; 	
		for(int i=0;i<D;i++)	{ 	if(MangInt[i]!=X){ MangTam[d]= MangInt[i];d++;}	}
		//	MangInt = MangTam;
		// D = d;
		cout << "\n\tMang co "<< D << " phan tu sau khi da bo cac tri bang " << X ;	
		XuatMangInt(d,MangTam);
	
		/*	int* pM=(int*)malloc(40*sizeof(int));
		cout << "\n\tSo phan tu trong mang pM: " << sizeof(pM);
		*pM=*MangTam;
		cout <<"\n\tContro:"<< pM << *MangTam;
			cout << "\n\tSo phan tu trong mangInt: " << sizeof(MangInt) <<"MangTam  "<< sizeof(MangTam) << "pM  " << sizeof(pM);
			XuatMangInt(D,MangTam);
			XuatMangInt(D,pM);
		X = 0;*/		
	}

// DEM SO PHAN TU KHONG NHO HON 4 TRONG MANG NGUYEN N PHAN TU va tinh diem trung binh.
int Dem_SoHvDat(int N, int* pI)
	{	int Dem=0;
		for(int i=0; i<N; i++)
		{	//Dem so hoc vien dat 
			if(pI[i]>=4) {  Dem++ ; }
		}
		return Dem;
	}

// TINH DIEM TRUNG BINH MON HOC TOAN LOP
float Tinh_DiemTBMH(int N, int* pI)
	{
		float DiemTB=0;
		for(int i=0; i<N; i++)
		{	
			//Tinh tong so diem mon hoc cua toan lop.
			DiemTB =DiemTB + (float)pI[i];
		}
		// Tinh diem trung binh
		DiemTB=DiemTB/(float)N;	
		return DiemTB;
	}
		
main()
{
	char c = 0;
	int  N ;
	int* pI;  // CON TRO pI de chuan bi cho bo nho N so nguyen se nhap vao.
	stringstream ss;
	string s;
while (c!=115)	{

// nhap so lieu 
	cout << "\n\n\n\tXin cho biet so phan tu so nguyen can nhap N :  ";
	cin >>  N ; 
	pI = (int*)malloc(N*sizeof(int));
	NhapMangInt(N, pI);
//============================

// IN RA MAN HINH CAC TRI DA NHAP		
	cout << "\n\tCac so da nhap: \n"	;
	for (int i=0; i<N; i++)
		{
		cout << "\t"<< pI[i]; 
		}	
//===============================

// TINH TONG CAC SO LE TRONG MANG 
	cout << "\n\tTong cac so le trong mang " << N <<" so nguyen vua nhap:";
	cout << "\n\tTong = " <<TongCacSoLe(N,pI) <<"\n";
	

// TRICH MANG SO NGUYEN TO pSNT TRONG MANG N SO NGUYEN pI	
	int NumOfSNT=0 , *pSNT;
	pSNT = (int*)malloc(N*sizeof(int));
	NumOfSNT = TrichMangSNT(N,pI,pSNT);
	cout << "\n\tTrong mang nguyen nay co " << NumOfSNT << " So NT." ;
	XuatMangInt(NumOfSNT, pSNT);
	free(pSNT);
//===============================	
	
// TRICH MANG BOI SO CUA X pBSX TRONG MANG N SO NGUYEN pI
	// Nhap gia tri nguyen 
	int X ; 
	cout << "\n\tHay nhap so nguyen X:" ;
	cin >> X ; 
	int* pBS_cua_X;
	pBS_cua_X=(int*)malloc(N*sizeof(int));
	TrichMangBSX(N,pI,X,pBS_cua_X);
	free(pBS_cua_X);
	
//======================================	


// TRICH MANG CAC SO NGUYEN LON HON HAI SO LAN CAN TRUOC SAU TRONG MANG N SO NGUYEN 
	int* p_nLn=(int*)malloc(N/3*sizeof(int));
	TrichMang_nLn(N, pI, p_nLn);
	free(p_nLn);
//==========================================



//  TIM MAX VA MIN TRONG MANG N NGUYEN 
	int MAX , MIN;
	MAX=TimMax(N, pI);	
	MIN=TimMin(N,pI);
	cout << "\n\tSO NGUYEN LON NHAT TRONG MANG: " << MAX ;
	cout << "\n\tSO NGUYEN NHO NHAT TRONG MANG: " << MIN ;
//=============================

	
// THEM MOT PHAN TU pI[K] VAO mang N SO NGUYEN THANH MANG N+1 SO NGUYEN.
	int  Y , ViTriNk;
	cout << "\n\tBan muon them so Y vao vi tri k cua mang?\n\tHay nhap hai gia tri Y va k : ";
	cin >> Y >> ViTriNk ;
	if(ViTriNk < N+1)	
	{
	int* MangThemIk = (int*)malloc((N+1)*sizeof(int));
	MangThemIk=ThemPhanTuK(N,pI,Y, ViTriNk);
	
	cout << "\n\tMang co "<< N+1 << " phan tu:";
	XuatMangInt(N+1,MangThemIk);
	free(MangThemIk);
	}
//=================================================

// BO BOT PHAN TU VI TRI K TRONG MANG NGUYEN INT
	cout << "\n\tBan muon bo bot phan tu o vi tri k = ?\n\tHay nhap k : ";
	cin >> ViTriNk ;
	if(ViTriNk<N)
		{
		int*  MangBotIk=(int*)malloc((N-1)*sizeof(int));
		MangBotIk=XoaPhanTuK(N,pI,ViTriNk)	;
		XuatMangInt(N-1,MangBotIk);
		free(MangBotIk);
		}

// XOA CAC TRI SO X TRONG MANG NGUYEN 
	cout <<"\n\tMang truoc khi xoa phan tu M["<< ViTriNk <<"]";
	XuatMangInt(N, pI);
	cout << "\n\tCho biet tri so can xoa khoi mang ";
	cin >> X;
	XoaX_in_MangInt(N,pI,X);
//==================================

// DEM SO HOC VIEN DAT VA TINH DIEM TRUNG BINH MON HOC CUA TOAN LOP
	cout << "\n\tBang diem co "<< N << " hoc vien.";
	cout << "\n\tSo hoc vien co diem dat yeu cau : " << Dem_SoHvDat(N,pI);
	printf( "\n\tDiem Trung Binh Mon Hoc Toan Lop : %2.2f ", Tinh_DiemTBMH(N,pI));
//========================================
	
// THOAT HAY TIEP TUC CHUONG TRINH ?		
	cout << "\n\n\tBAM PHIM s thuong DE NGUNG CHUONG TRINH";
	c=getch();
	
}
	
}